New Multigrid Solver Advances in TOPS
نویسندگان
چکیده
In this paper, we highlight new multigrid solver advances in the Terascale Optimal PDE Simulations (TOPS) project in the Scientific Discovery Through Advanced Computing (SciDAC) program. We discuss two new algebraic multigrid (AMG) developments in TOPS: the adaptive smoothed aggregation method (αSA) and a coarse-grid selection algorithm based on compatible relaxation (CR). The αSA method is showing promising results in initial studies for Quantum Chromodynamics (QCD) applications. The CR method has the potential to greatly improve the applicability of AMG.
منابع مشابه
Extending the applicability of multigrid methods
Multigrid methods are ideal for solving the increasingly large-scale problems that arise in numerical simulations of physical phenomena because of their potential for computational costs and memory requirements that scale linearly with the degrees of freedom. Unfortunately, they have been historically limited by their applicability to elliptic-type problems and the need for special handling in ...
متن کاملAdvances in High-performance Computing: Multigrid Methods for Partial Diierential Equations and Its Applications
The program package UG provides a software platform for discretizing and solving partial diierential equations. It supports high level numerical methods for unstructured grids on massively parallel computers. Various applications of complex up to real-world problems have been realized, like Navier-Stokes problems with turbulence modeling, combustion problems, two-phase ow, density driven ow and...
متن کاملAn Efficient, Geometric Multigrid Solver for the Anisotropic Diffusion Equation in Two and Three Dimensions
We propose a new geometric multigrid solver for anisotropic image diffusion. Anisotropic diffusion in image processing has been widely accepted as a denoising method; however, the large computation times for large volumes are prohibitive for interactive exploration of the parameter space. Our approach is able to reduce computation times via a new method for restricting the anisotropic diffusion...
متن کاملSelf-correcting Multigrid Solver
A new multigrid algorithm based on the method of self-correction for the solution of elliptic problems is described. The method exploits information contained in the residual to dynamically modify the source term (right-hand side) of the elliptic problem. It is shown that the self-correcting solver is more efficient at damping the short wavelength modes of the algebraic error than its standard ...
متن کاملCompatible coarsening in the multigraph algorithm
We present some heuristics incorporating the philosophy of compatible relaxation into an existing algebraic multigrid method, the so-called multigraph solver of Bank and Smith [1]. In particular, approximate left and right eigenvectors of the iteration matrix for the smoother are used in computing both the sparsity pattern and the numerical values of the transfer matrices that correspond to res...
متن کامل